Phase I cycling under the most-obtuse-angle pivot rule
نویسندگان
چکیده
It has been recently claimed that the most-obtuse-angle pivot rule is one of the best choices for Phase I linear programs based on the simplex method. In this short note we give two instances of Phase I cycling under such ratio-test-free rule, both when it is used to obtain primal feasibility and when trying to achieve dual feasibility with its unnormalized counterpart. A crash procedure that is not objective-driven might be the cause, and a non-simplex active-set generalization could be used instead.
منابع مشابه
A basis-deficiency-allowing primal phase-I algorithm using the most-obtuse-angle column rule
The dual Phase-I algorithm using the most-obtuse-angle row pivot rule is very efficient for providing a dual feasible basis, in either the classical or the basisdeficiency-allowing context. In this paper, we establish a basis-deficiency-allowing Phase-I algorithm using the so-called most-obtuse-angle column pivot rule to produce a primal (deficient or full) basis. Our computational experiments ...
متن کاملOn simplex method with most-obtuse-angle rule and cosine rule
A class of simplex methods for solving linear programming (LP) problems, with cosine pivot rule, have been presented in some recent papers. In this paper we show that the cosine rule used in this class is equivalent to the mostobtuse-angle pivot rule, proposed by Pan (1990). The relation between the direct method for LP and the most-obtuse-angle rule is discussed.
متن کاملNew Optimal Pivot Rule for the Simplex Algorithm
The purpose of this paper is to introduce a new pivot rule of the simplex algorithm. The simplex algorithm first presented by George B. Dantzig, is a widely used method for solving a linear programming problem (LP). One of the important steps of the simplex algorithm is applying an appropriate pivot rule to select the basis-entering variable corresponding to the maximum reduced cost. Unfortunat...
متن کاملSystematic construction of examples for cycling in the simplex method
We present systematic procedures to construct examples of linear programs that cycle when the simplex method is applied. Cycling examples are constructed for diverse variants of pivot selection strategies: most negative reducedcost and steepest-edge rule for the entering variable, and smallest ratio rule for the leaving variable (where ties are broken according to the least-index or the largest...
متن کاملAn Experimental Investigation on Fracture Analysis of Polymer Matrix Composite under Different Thermal Cycling Conditions
Fracture analysis of glass/epoxy composites under different thermal cycling conditions is considered. Temperature difference, stacking sequence, fiber volume fraction and number of thermal cycles are selected as the experimental design factors. The Taguchi method is implemented to design of the experiment and an apparatus is developed for automatic thermal cycling tests. The tensile tests are d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 167 شماره
صفحات -
تاریخ انتشار 2005